Rate monotonic analysis: the hyperbolic bound

Rate Monotonic Analysis: The Hyperbolic Bound

In this paper, we propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic algorithm when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound, but it is less pessimistic, thus allowing it to accept task sets that would ...

A Hyperbolic Bound for the Rate Monotonic Algorithm

In this paper we propose a novel schedulability analysis for verihing the feasibility of large periodic task sets under the rate monotonic algorithm, when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound but it is less pessimistic, so allowing to accept task sets that would be reje...

Rate Monotonic Analysis in the RMADriver Application

Enhanced Rate Monotonic Time Demand Analysis

Latest real-time systems are capable of changing its speed at run time to prolong its battery life and, demand efficient techniques for online decisions making. Available real time feasibility tests have pseudo-polynomial complexity and can not be executed online. This paper proposes that the time complexity of existing techniques could be lowered when task schedulability is analyzed at points,...

Rate Monotonic Analysis for Real-Time Systems

The essential goal of the Rate Monotonic Analysis (RMA) for RealTime Systems Project at the Software Engineering Institute is to catalyze improvement in the practice of real-time systems engineering, specifically by increasing the use of rate monotonic analysis and scheduling algorithms. In this report, we review important decisions in the development of RMA. Our experience indicates that techn...